package algorithm.tree.bst;

public interface FuhaoBiaoI <T>{

  //增加
  public void put(T t);

  public void delete();

  public void get();

  //有多少个节点
  public int size();

}
